package leetcode.array;

import leetcode.array.common.ArrayUtils;

class Solution6350 {
    public int maxDivScore(int[] nums, int[] divisors) {
        return ArrayUtils.maxDivScore(nums, divisors);
    }
}

public class leetcode6350 {
    public static void main(String[] args) {
        Solution6350 solution6350 = new Solution6350();
        int[] nums = {4, 7, 9, 3, 9};
        int[] divisors = {5, 2, 3};

        int[] nums1 = {73, 13, 20, 6};
        int[] divisors1 = {56, 75, 83, 26, 24, 53, 56, 61};

        int[] nums2 = {13, 32, 52, 58, 12, 95, 51, 38, 80, 27, 71, 64, 43, 83, 18};
        int[] divisors2 = {12, 35, 80, 16, 44};

        int[] nums3 = {12};
        int[] divisors3 = {10, 16};
        System.out.println(solution6350.maxDivScore(nums, divisors));
        System.out.println(solution6350.maxDivScore(nums1, divisors1));
        System.out.println(solution6350.maxDivScore(nums2, divisors2));
        System.out.println(solution6350.maxDivScore(nums3, divisors3));
    }
}
